Core-Implementing Nash Equilibrium in the Vickrey Auction and Some Unstable Mechanisms

نویسنده

  • Ryuji Sano
چکیده

This paper demonstrates the Vickrey auction has a Nash equilibrium in the core. Generally, the dominant-strategy-equilibrium outcome of the Vickrey auction is not located in the core. However, a particular profile of truncation strategies is a Nash equilibrium, and it implements an outcome in the bidderoptimal core. The specified strategy profile is identical to that in core-selecting auctions discussed by Day and Milgrom (Int. J. Game Theory 2008). We introduce “Vickrey-reserving” auctions and show that a core-implementing Nash equilibrium exists in every Vickrey-reserving auction. JEL classification: D44

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Comments on Alternative Policy Options for Managing Capacity and Mitigating Congestion and Delay at LaGuardia Airport

A family of ascending package auction models is introduced in which bidders may determine their own packages on which to bid. In the proxy auction (revelation game) versions, the outcome is a point in the core of the exchange economy for the reported preferences. When payoffs are linear in money and goods are substitutes, sincere reporting constitutes a Nash equilibrium and the outcome coincide...

متن کامل

Risk aversion and loss aversion in core-selecting auctions

Core-selecting combinatorial auctions have been introduced as an alternative to the Vickrey-Clarke-Groves (VCG) mechanism because VCG results in payments that are not in the core with respect to bids, leading to unfair payments, unacceptably low revenues, and unstable outcomes. This raises an auction selection problem for an auctioneer deciding whether to employ a core-selecting auction or VCG ...

متن کامل

An Ascending-Price Generalized Vickrey Auction

A simple characterization of the equilibrium conditions required to compute Vickrey payments in the Combinatorial Allocation Problem leads to an ascending price Generalized Vickrey Auction. The ascending auction, iBundle Extend & Adjust (iBEA), maintains non-linear and perhaps non-anonymous prices on bundles of items, and terminates with the efficient allocation and the Vickrey payments in ex p...

متن کامل

Efficiency Through Revenue Redistribution in Auctions with Entry

We consider a single-item private values auction setting with endogenous costly entry. We demonstrate that for symmetric bidders and entry costs that are an arbitrary linear function of value, a unique symmetric Bayes-Nash “cutoff equilibrium” (where only agents with value above some threshold enter) obtains under the Vickrey auction and also a broader class of revenue-redistributing auctions. ...

متن کامل

A Simple Ascending Generalized Vickrey Auction∗

We design a simple ascending Vickrey auction for the combinatorial allocation problem. We make use of a concept called universal competitive equilibrium (UCE) price to design our auction. Our auction searches for a UCE price, which (along with an efficient allocation) provides enough information to compute the Vickrey payments of buyers. Our auction maintains non-linear and non-anonymous prices...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2010